package com.feng.leetcode;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

/**
 * @author feng
 * @decrition
 * @date 2022/10/2523:12
 */
public class L934 {
    public static int shortestBridge(int[][] grid) {
        List<String> land1 = new ArrayList<String>();
        int side1 = 0;
        List<String> land2 = new ArrayList<String>();
        int side2 = 0;
        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[i].length; j++) {
                if (grid[i][j] == 1) {
                    side1 = isLand(grid, land1, i, j);
                }
            }
        }
        return 0;
    }

    private static int isLand(int[][] grid, List<String> land1, int i, int j) {
        land1.add(i + "" + j);
        if (grid[i][j + 1] == 1) {
            land1.add(i + "" + j + 1);
        }
        return 0;
    }

    public static void main(String[] args) {

    }
}
